Maximum-likelihood-estimate Hamiltonian learning via efficient and robust quantum likelihood gradient
نویسندگان
چکیده
Given the recent developments in quantum techniques, modeling physical Hamiltonian of a target many-body system is becoming an increasingly practical and vital research direction. Here, we propose efficient strategy combining maximum likelihood estimation, gradient descent, algorithms. measurement outcomes, optimize model density operator via series descents along gradient, which prove negative semi-definite with respect to negative-log-likelihood function. In addition such optimization efficiency, our maximum-likelihood-estimate learning respects locality given system, therefore, extends readily larger systems available Compared previous approaches, it also exhibits better accuracy overall stability toward noises, fluctuations, temperature ranges, demonstrate various examples.
منابع مشابه
An Inconsistent Maximum Likelihood Estimate
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملGradient-based stopping rules for maximum-likelihood quantum-state tomography
When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems. The optimization is usually performed with iterative algorithms. This paper provides a gradient-based upper bound on the ratio of the true maximum likelihood and the likelihood of the state of the cur...
متن کاملMaximum Likelihood Competitive Learning
One popular class of unsupervised algorithms are competitive algorithms. In the traditional view of competition, only one competitor, the winner, adapts for any given case. I propose to view competitive adaptation as attempting to fit a blend of simple probability generators (such as gaussians) to a set of data-points. The maximum likelihood fit of a model of this type suggests a "softer" form ...
متن کاملMaximum-Likelihood Estimate for Distance Matrix
The structure of relationship among subjects is an interesting topic in many social studies, especially phylogeny. The between-subject relationships are commonly measured by similarity or dissimilarity metrics and represented using a distance matrix. Based on this distance matrix, a tree can be constructed to characterize the overall structure of inferred relationships among all subjects. Curre...
متن کاملEfficient maximum likelihood pedigree reconstruction.
A simple and efficient algorithm is presented for finding a maximum likelihood pedigree using microsatellite (STR) genotype information on a complete sample of related individuals. The computational complexity of the algorithm is at worst (O(n(3)2(n))), where n is the number of individuals. Thus it is possible to exhaustively search the space of all pedigrees of up to thirty individuals for one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review research
سال: 2023
ISSN: ['2643-1564']
DOI: https://doi.org/10.1103/physrevresearch.5.023136